Sequential Approach for Identifying Lead Compounds in Large Chemical Databases
نویسندگان
چکیده
منابع مشابه
A Sequential Approach for Identifying Lead Compounds in Large Chemical Databases
At the early stage of drug discovery, many thousands of chemical compounds can be synthesized and tested (assayed) for potency (activity) with High Throughput Screening (HTS). With ever increasing numbers of compounds to be tested (now often in the neighborhood of 500,000) it remains a challenge to find strategies via sequential design that reduce costs while locating classes of active compound...
متن کاملImproving Drug Discovery Process by Identifying Frequent Toxic Substructures in Chemical Compounds - A Graph Mining Approach
Discovery of drug using computer modeling is one of the major challenges in contemporary medicine. Developing new therapeutic drugs is an expensive and time consuming process. Toxicity, caused by substructures that are carcinogenic in nature, is one of the important aspects that need to be explored during drug discovery. The use of in silico methods at an early stage of drug discovery can great...
متن کاملA Clustering Approach for Large Visual Databases
The representation and organization of images in a large-scale image database is crucial to support eeective and eecient accesses to image data on the basis of content. In this process, signiicant features must rst be extracted from image data in their pixel format. These features must then be classiied and indexed to assist eecient retrieval of image content. In this paper, we investigate eeec...
متن کاملAn overview of large chemical structure databases
This presentation covers a number of large (arbitrarily defined as greater than 1 million structures) chemical structure databases currently available, or soon to be available, on the Internet. Just a few years ago there were only two large, but rather different databases of organic chemicals available Beilstein and Chemical Abstracts. For the most part, the former contained data while the latt...
متن کاملFast Mining of Sequential Patterns in Very Large Databases
In this paper we present a new algorithm for fast discovery of Sequential Patterns. Given a collection of items, a set of records over those items, and records belonging to a customer, the task is to identify all the commonly occurring sequences of items bought by the customers. An example of a sequential pattern could be that \30% of the people buying Douglas Adam's The Hitchhiker's Guide to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Science
سال: 2001
ISSN: 0883-4237
DOI: 10.1214/ss/1009213288